Decomposing Linear Programs for Parallel Solution
نویسندگان
چکیده
Coarse grain parallelism inherent in the solution of Linear Programming LP problems with block angular constraint matrices has been exploited in recent research works However these approaches su er from unscalability and load imbalance since they exploit only the exist ing block angular structure of the LP constraint matrix In this paper we consider decomposing LP constraint matrices to obtain block angular structures with speci ed number of blocks for scalable parallelization We propose hypergraph models to represent LP constraint matrices for de composition In these models the decomposition problem reduces to the well known hypergraph partitioning problem A Kernighan Lin based multiway hypergraph partitioning heuristic is implemented for experi menting with the performance of the proposed hypergraph models on the decomposition of the LP problems selected from NETLIB suite Initial results are promising and justify further research on other hypergraph partitioning heuristics for decomposing large LP problems
منابع مشابه
Partitioning mathematical programs for parallel solution
This paper describes heuristics for partitioning a general M x N matrix into arrowhead form. Such heuristics are useful for decomposing large, constrained, optimization problems into forms that are amenable to parallel processing. The heuristics presented can be easily implemented using publicly available graph partitioning algorithms. The application of such techniques for solving large linear...
متن کاملAn Effective Model to Decompose Linear Programs for Parallel Solution
Although inherent parallelism in the solution of block angular Linear Programming (LP) problems has been exploited in many research works, the literature that addresses decomposing constraint matrices into block angular form for parallel solution is very rare and recent. We have previously proposed hypergraph models, which reduced the problem to the hypergraph partitioning problem. However, the...
متن کاملComputer extended series and HAM for the solution of non-linear Squeezing flow of Casson fluid between parallel plates
The paper presents analysis of two-dimensional non-Newtonian incompressible viscous flow between parallel plates. The governing problem of momentum equations are reduced to NODE using similarity transformations. The resulting equation is solved using series solution and homotopy analysis method. These methods have advantages over pure numerical methods for obtaining the derived quantities accur...
متن کاملAn Analysis of the Parallel Computation of Arbitrarily Branched Cable Neuron Models
We present and analyze a parallel method for the solution of partial diierential equation models of the nervous system. These models mathematically are one-dimensional nonlinear parabolic equations deened on branching domains. Implicit methods for these equations leads to numerical solution of diagonally dominant almost tridiagonal linear systems at each time step. We rst review some exact meth...
متن کاملDecomposing solution sets of polynomial systems: a new parallel monodromy breakup algorithm
We consider the numerical irreducible decomposition of a positive dimensional solution set of a polynomial system into irreducible factors. Path tracking techniques computing loops around singularities connect points on the same irreducible components. The computation of a linear trace for each factor certifies the decomposition. This factorization method exhibits a good practical performance o...
متن کامل